- invariant strategy
- инвариантная стратегия
Англо-русский словарь по экономике и финансам. — М.: Экономическая школа. А.В. Аникин, И.М. Оседчая, Б.Г. Федоров. 1993.
invariant strategy
Смотреть что такое "invariant strategy" в других словарях:
Loop invariant — In computer science, a loop invariant is an invariant used to prove properties of loops.Specifically in Floyd Hoare logic, the partial correctness of a while loop is governed by the following rule of inference::frac{{Cland I};mathrm{body};{I… … Wikipedia
Evolution strategy — In computer science, evolution strategy (ES) is an optimization technique based on ideas of adaptation and evolution. It belongs to the general class of evolutionary computation or artificial evolution methodologies. Contents 1 History 2 Methods… … Wikipedia
Natural evolution strategy — Natural evolution strategies (NES) are a family of numerical optimization algorithms for black box problems. Similar in spirit to evolution strategies, they iteratively update the (continuous) parameters of a search distribution by following the… … Wikipedia
CMA-ES — stands for Covariance Matrix Adaptation Evolution Strategy. Evolution strategies (ES) are stochastic, derivative free methods for numerical optimization of non linear or non convex continuous optimization problems. They belong to the class of… … Wikipedia
Object recognition (computer vision) — Feature detection Output of a typical corner detection algorithm … Wikipedia
Garbage collection (computer science) — This article is about garbage collection in memory management. For garbage collection in an SSD, see garbage collection (SSD). For other uses, see garbage collection. In computer science, garbage collection (GC) is a form of automatic memory… … Wikipedia
Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… … Wikipedia
Const-correctness — In computer science, const correctness is the form of program correctness that deals with the proper declaration of objects as mutable or immutable. The term is mostly used in a C or C++ context, and takes its name from the const keyword in those … Wikipedia
Floer homology — is a mathematical tool used in the study of symplectic geometry and low dimensional topology. First introduced by Andreas Floer in his proof of the Arnold conjecture in symplectic geometry, Floer homology is a novel homology theory arising as an… … Wikipedia
Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… … Wikipedia
Six Sigma — Not to be confused with Sigma 6. The often used Six Sigma symbol Part of a series of articles on I … Wikipedia
